Diaprism Hardware Sorter — Sort a Million Records in 0.980 Second —
نویسنده
چکیده
In the new millennium, the DIAPRISM hardware sorter by Mitsubishi Electric Corp. has broken the 1-second barrier of Datamation benchmark for the first time in the world and achieved the record, sorting a million 100-byte records in 0.998 second. Now in the new century, we have improved on our own record by employing new CPUs and tuning up the program. The new record is 0.980 second. This document is an updated version of the previous one and also contains the description about the program.
منابع مشابه
Design, Development and Evaluation of an Orange Sorter Based on Machine Vision and Artificial Neural Network Techniques
ABSTRACT- The high production of orange fruit in Iran calls for quality sorting of this product as a requirement for entering global markets. This study was devoted to the development of an automatic fruit sorter based on size. The hardware consisted of two units. An image acquisition apparatus equipped with a camera, a robotic arm and controller circuits. The second unit consisted of a robotic...
متن کاملA hardware sort - merge system
A hardware sort-merge system which can sort large files rapidly is proposed. It consists of an initial sorter and a pipelined merger. In the initial sorter, record sorting is divided into two parts: key-pointer sorting and record rearranging. The pipelined merger is composed of several intelligent disks each of which has a simple processor and some buffers. The hardware sortmerge system can sor...
متن کاملTagged Up/Down Sorter - A Hardware Priority Queue
We present a hardware oriented priority queue algorithm requiring n2 comparators and swappers to maintain an n item queue. It supports two operations, insert and extract minimum (or alternatively, extract maximum), both of which operate in a single cycle. Thus, sorting time is O(n). Records with identical keys are always extracted in FIFO order of insertion. A formal proof of correctness of the...
متن کاملHigh performance Parallel Linear Sorter Core Design
Hardware sorters exploit inherent concurrency to improve the performance of sequential, softwarebased sorting algorithms. They are often based on Batcher’s odd-even or bitonic merging networks to attenuate the areagreedy hardware solutions. In this paper, a new hardware sorter architecture is presented. It is composed of smaller sorter circuits inspired on insertion sorting algorithms that cont...
متن کاملTradeoff Analysis and Architecture Design of a Hybrid Hardware/Software Sorter
Sorting long sequences of keys is a problem that occurs in many different applications. For embedded systems, a uniprocessor software solution is often not applicable due to the low performance, while realizing multiprocessor sorting methods on parallel computers is much too expensive with respect to power consumption, physical weight, and cost. We investigate cost/performance tradeoffs for hyb...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001